Efficacy of 1 L polyethylene glycol plus ascorbate versus 4 L polyethylene glycol in split-dose for colonoscopy cleansing in out and inpatient: A multicentre, randomized trial (OVER 2019).

BACKGROUND AND AIMS: Adequate bowel cleansing is essential for colonoscopy quality. A novel 1 L polyethylene glycol plus ascorbate (1 L PEG+ASC) solution has been recently introduced. Nevertheless, the efficacy of 1 L PEG+ASC as compared to that of high-volume bowel preparation in both inpatients and outpatients is still unclear. PATIENTS AND METHODS: This single-blinded, non-inferiority study randomized patients undergoing colonoscopy to receive split-dose 1 L PEG+ASC or 4 L PEG. The primary endpoint was the overall cleansing success. Secondary endpoints were excellent cleansing and high-quality cleansing of the right colon, as well as lesions detection rate, patient compliance, tolerability and safety. RESULTS: Overall, 478 patients were randomized to 1 L PEG+ASC (N = 236) or 4 L PEG (N = 242). The 1 L PEG+ASC showed higher cleansing success rate (91.8% vs 83.6%; P=0.01) and a high-quality cleansing of the right colon (52.3% and 38.5%; P=0.004) compared to 4 L PEG. Moreover, 1 L PEG+ASC achieved a higher cleansing success in out-patients (96.3%% vs 88.6%; P=0.018), and a similar success rate in the in-patients (84.7% vs 76.7%; P=0.18). Adenoma detection rate, tolerability and incidence of adverse events were comparable between preparations. CONCLUSIONS: The 1 L PEG+ASC showed higher efficacy in achieving adequate colon cleansing compared with 4 L PEG, particularly in the right colon. No differences in the tolerability and safety were detected.

L-lactate production in engineered Saccharomyces cerevisiae using a multistage multiobjective automated design framework.

The design of alternative biodegradable polymers has the potential of severely reducing the environmental impact, cost and production time currently associated with the petrochemical industry. In fact, growing demand for renewable feedstock has recently brought to the fore synthetic biology and metabolic engineering. These two interdependent research areas focus on the study of microbial conversion of organic acids, with the aim of replacing their petrochemical-derived equivalents with more sustainable and efficient processes. The particular case of Lactic acid (LA) production has been the subject of extensive research because of its role as an essential component for developing an eco-friendly biodegradable plastic-widely used in industrial biotechnological applications. Because of its resistance to acidic environments, among the many LA-producing microbes, Saccharomyces cerevisiae has been the main focus of research into related biocatalysts. In this study, we present an extensive in silico investigation of S. cerevisiae cell metabolism (modeled with Flux Balance Analysis) with the overall aim of maximizing its LA production yield. We focus on the yeast 8.3 steady-state metabolic model and analyze it under the impact of different engineering strategies including: gene knock-in, gene knock-out, gene regulation and medium optimization; as well as a comparison between results in aerobic and anaerobic conditions. We designed ad-hoc constrained multiobjective evolutionary algorithms to automate the engineering process and developed a specific postprocessing methodology to analyze the genetic manipulation results obtained. The in silico results reported in this paper empirically show that our method is able to automatically select a small number of promising genetic and metabolic manipulations, deriving competitive strains that promise to impact microorganisms design in the production of sustainable chemicals.

Pareto optimal metabolic engineering for the growth-coupled overproduction of sustainable chemicals.

Our research aims to help industrial biotechnology develop a sustainable economy using green technology based on microorganisms and synthetic biology through two case studies that improve metabolic capacity in yeast models Yarrowia lipolytica (Y. lipolytica) and Saccharomyces cerevisiae (S. cerevisiae). We aim to increase the production capacity of beta-carotene (ß-carotene) and succinic acid, which are among the highest market demands due to their versatile use in numerous consumer products. We performed simulations to identify in silico ranking of strains based on multiple objectives: the growth rate of yeast microorganisms, the number of used chromosomes, and the production capability of ß-carotene (for Y. lipolytica) and succinate (for S. cerevisiae). Our multiobjective optimization methodology identified notable gene deletions by searching a vast solution space to highlight near-optimal strains on Pareto Fronts, balancing the above-cited three objectives. Moreover, preserving the metabolic constraints and the essential genes, this study produced robust results: seven significant strains of Y. lipolytica and seven strains of S. cerevisiae. We examined gene knockout to study the function of genes and pathways. In fact, by studying the frequently silenced genes, we found that when the GPH1 gene is knocked out in S. cerevisiae, the isocitrate lyase enzyme is activated, which converts the isocitrate into succinate. Our goals are to simplify and facilitate the in vitro processes. Hence, we present strains with the least possible number of knockout genes and solutions in which the genes are turned off on the same chromosome. Therefore, we present results where the constraints mentioned above are met, like the strains where only two genes are switched off and other strains where half of the knockout genes are on the same chromosome. This study offers solutions for developing an efficient in vitro mutagenesis for microorganisms and demonstrates the efficiency of multiobjective optimization in automatizing metabolic engineering processes.

Backpropagation Neural Tree.

We propose a novel algorithm called Backpropagation Neural Tree (BNeuralT), which is a stochastic computational dendritic tree. BNeuralT takes random repeated inputs through its leaves and imposes dendritic nonlinearities through its internal connections like a biological dendritic tree would do. Considering the dendritic-tree like plausible biological properties, BNeuralT is a single neuron neural tree model with its internal sub-trees resembling dendritic nonlinearities. BNeuralT algorithm produces an ad hoc neural tree which is trained using a stochastic gradient descent optimizer like gradient descent (GD), momentum GD, Nesterov accelerated GD, Adagrad, RMSprop, or Adam. BNeuralT training has two phases, each computed in a depth-first search manner: the forward pass computes neural tree's output in a post-order traversal, while the error backpropagation during the backward pass is performed recursively in a pre-order traversal. A BNeuralT model can be considered a minimal subset of a neural network (NN), meaning it is a "thinned" NN whose complexity is lower than an ordinary NN. Our algorithm produces high-performing and parsimonious models balancing the complexity with descriptive ability on a wide variety of machine learning problems: classification, regression, and pattern recognition.

VDAC Genes Expression and Regulation in Mammals.

VDACs are pore-forming proteins, coating the mitochondrial outer membrane, and playing the role of main regulators for metabolites exchange between cytosol and mitochondria. In mammals, three isoforms have evolutionary originated, VDAC1, VDAC2, and VDAC3. Despite similarity in sequence and structure, evidence suggests different biological roles in normal and pathological conditions for each isoform. We compared Homo sapiens and Mus musculus VDAC genes and their regulatory elements. RNA-seq transcriptome analysis shows that VDAC isoforms are expressed in human and mouse tissues at different levels with a predominance of VDAC1 and VDAC2 over VDAC3, with the exception of reproductive system. Numerous transcript variants for each isoform suggest specific context-dependent regulatory mechanisms. Analysis of VDAC core promoters has highlighted that, both in a human and a mouse, VDAC genes show features of TATA-less ones. The level of CG methylation of the human VDAC genes revealed that VDAC1 promoter is less methylated than other two isoforms. We found that expression of VDAC genes is mainly regulated by transcription factors involved in controlling cell growth, proliferation and differentiation, apoptosis, and bioenergetic metabolism. A non-canonical initiation site termed "the TCT/TOP motif," the target for translation regulation by the mTOR pathway, was identified in human VDAC2 and VDAC3 and in every murine VDACs promoter. In addition, specific TFBSs have been identified in each VDAC promoter, supporting the hypothesis that there is a partial functional divergence. These data corroborate our experimental results and reinforce the idea that gene regulation could be the key to understanding the evolutionary specialization of VDAC isoforms.

Pareto Optimality in Multilayer Network Growth.

We model the formation of multilayer transportation networks as a multiobjective optimization process, where service providers compete for passengers, and the creation of routes is determined by a multiobjective cost function encoding a trade-off between efficiency and competition. The resulting model reproduces well real-world systems as diverse as airplane, train, and bus networks, thus suggesting that such systems are indeed compatible with the proposed local optimization mechanisms. In the specific case of airline transportation systems, we show that the networks of routes operated by each company are placed very close to the theoretical Pareto front in the efficiency-competition plane, and that most of the largest carriers of a continent belong to the corresponding Pareto front. Our results shed light on the fundamental role played by multiobjective optimization principles in shaping the structure of large-scale multilayer transportation systems, and provide novel insights to service providers on the strategies for the smart selection of novel routes.

Conformational Sampling of a Biomolecular Rugged Energy Landscape.

The protein structure refinement using conformational sampling is important in hitherto protein studies. In this paper, we examined the protein structure refinement by means of potential energy minimization using immune computing as a method of sampling conformations. The method was tested on the x-ray structure and 30 decoys of the mutant of [Leu]Enkephalin, a paradigmatic example of the biomolecular multiple-minima problem. In order to score the refined conformations, we used a standard potential energy function with the OPLSAA force field. The effectiveness of the search was assessed using a variety of methods. The robustness of sampling was checked by the energy yield function which measures quantitatively the number of the peptide decoys residing in an energetic funnel. Furthermore, the potential energy-dependent Pareto fronts were calculated to elucidate dissimilarities between peptide conformations and the native state as observed by x-ray crystallography. Our results showed that the probed potential energy landscape of [Leu]Enkephalin is self-similar on different metric scales and that the local potential energy minima of the peptide decoys are metastable, thus they can be refined to conformations whose potential energy is decreased by approximately 250 kJ/mol.

Pareto Optimal Design for Synthetic Biology.

Recent advances in synthetic biology call for robust, flexible and efficient in silico optimization methodologies. We present a Pareto design approach for the bi-level optimization problem associated to the overproduction of specific metabolites in Escherichia coli. Our method efficiently explores the high dimensional genetic manipulation space, finding a number of trade-offs between synthetic and biological objectives, hence furnishing a deeper biological insight to the addressed problem and important results for industrial purposes. We demonstrate the computational capabilities of our Pareto-oriented approach comparing it with state-of-the-art heuristics in the overproduction problems of i) 1,4-butanediol, ii) myristoyl-CoA, i ii) malonyl-CoA , iv) acetate and v) succinate. We show that our algorithms are able to gracefully adapt and scale to more complex models and more biologically-relevant simulations of the genetic manipulations allowed. The Results obtained for 1,4-butanediol overproduction significantly outperform results previously obtained, in terms of 1,4-butanediol to biomass formation ratio and knock-out costs. In particular overproduction percentage is of +662.7%, from 1.425 mmolh⁻¹gDW⁻¹ (wild type) to 10.869 mmolh⁻¹gDW⁻¹, with a knockout cost of 6. Whereas, Pareto-optimal designs we have found in fatty acid optimizations strictly dominate the ones obtained by the other methodologies, e.g., biomass and myristoyl-CoA exportation improvement of +21.43% (0.17 h⁻¹) and +5.19% (1.62 mmolh⁻¹gDW⁻¹), respectively. Furthermore CPU time required by our heuristic approach is more than halved. Finally we implement pathway oriented sensitivity analysis, epsilon-dominance analysis and robustness analysis to enhance our biological understanding of the problem and to improve the optimization algorithm capabilities.

Inferring pathological states in cortical neuron microcircuits.

The brain activity is to a large extent determined by states of neural cortex microcircuits. Unfortunately, accuracy of results from neural circuits׳ mathematical models is often biased by the presence of uncertainties in underlying experimental data. Moreover, due to problems with uncertainties identification in a multidimensional parameters space, it is almost impossible to classify states of the neural cortex, which correspond to a particular set of the parameters. Here, we develop a complete methodology for determining uncertainties and the novel protocol for classifying all states in any neuroinformatic model. Further, we test this protocol on the mathematical, nonlinear model of such a microcircuit developed by Giugliano et al. (2008) and applied in the experimental data analysis of Huntington׳s disease. Up to now, the link between parameter domains in the mathematical model of Huntington׳s disease and the pathological states in cortical microcircuits has remained unclear. In this paper we precisely identify all the uncertainties, the most crucial input parameters and domains that drive the system into an unhealthy state. The scheme proposed here is general and can be easily applied to other mathematical models of biological phenomena.

Multi-Target Analysis and Design of Mitochondrial Metabolism.

Analyzing and optimizing biological models is often identified as a research priority in biomedical engineering. An important feature of a model should be the ability to find the best condition in which an organism has to be grown in order to reach specific optimal output values chosen by the researcher. In this work, we take into account a mitochondrial model analyzed with flux-balance analysis. The optimal design and assessment of these models is achieved through single- and/or multi-objective optimization techniques driven by epsilon-dominance and identifiability analysis. Our optimization algorithm searches for the values of the flux rates that optimize multiple cellular functions simultaneously. The optimization of the fluxes of the metabolic network includes not only input fluxes, but also internal fluxes. A faster convergence process with robust candidate solutions is permitted by a relaxed Pareto dominance, regulating the granularity of the approximation of the desired Pareto front. We find that the maximum ATP production is linked to a total consumption of NADH, and reaching the maximum amount of NADH leads to an increasing request of NADH from the external environment. Furthermore, the identifiability analysis characterizes the type and the stage of three monogenic diseases. Finally, we propose a new methodology to extend any constraint-based model using protein abundances.

Pareto optimality in organelle energy metabolism analysis.

In low and high eukaryotes, energy is collected or transformed in compartments, the organelles. The rich variety of size, characteristics, and density of the organelles makes it difficult to build a general picture. In this paper, we make use of the Pareto-front analysis to investigate the optimization of energy metabolism in mitochondria and chloroplasts. Using the Pareto optimality principle, we compare models of organelle metabolism on the basis of single- and multiobjective optimization, approximation techniques (the Bayesian Automatic Relevance Determination), robustness, and pathway sensitivity analysis. Finally, we report the first analysis of the metabolic model for the hydrogenosome of Trichomonas vaginalis, which is found in several protozoan parasites. Our analysis has shown the importance of the Pareto optimality for such comparison and for insights into the evolution of the metabolism from cytoplasmic to organelle bound, involving a model order reduction. We report that Pareto fronts represent an asymptotic analysis useful to describe the metabolism of an organism aimed at maximizing concurrently two or more metabolite concentrations.

A design automation framework for computational bioenergetics in biological networks.

The bioenergetic activity of mitochondria can be thoroughly investigated by using computational methods. In particular, in our work we focus on ATP and NADH, namely the metabolites representing the production of energy in the cell. We develop a computational framework to perform an exhaustive investigation at the level of species, reactions, genes and metabolic pathways. The framework integrates several methods implementing the state-of-the-art algorithms for many-objective optimization, sensitivity, and identifiability analysis applied to biological systems. We use this computational framework to analyze three case studies related to the human mitochondria and the algal metabolism of Chlamydomonas reinhardtii, formally described with algebraic differential equations or flux balance analysis. Integrating the results of our framework applied to interacting organelles would provide a general-purpose method for assessing the production of energy in a biological network.

Efficient behavior of photosynthetic organelles via Pareto optimality, identifiability, and sensitivity analysis.

In this work, we develop methodologies for analyzing and cross comparing metabolic models. We investigate three important metabolic networks to discuss the complexity of biological organization of organisms, modeling, and system properties. In particular, we analyze these metabolic networks because of their biotechnological and basic science importance: the photosynthetic carbon metabolism in a general leaf, the Rhodobacter spheroides bacterium, and the Chlamydomonas reinhardtii alga. We adopt single- and multi-objective optimization algorithms to maximize the CO 2 uptake rate and the production of metabolites of industrial interest or for ecological purposes. We focus both on the level of genes (e.g., finding genetic manipulations to increase the production of one or more metabolites) and on finding concentration enzymes for improving the CO 2 consumption. We find that R. spheroides is able to absorb an amount of CO 2 until 57.452 mmol h (-1) gDW (-1) , while C. reinhardtii obtains a maximum of 6.7331. We report that the Pareto front analysis proves extremely useful to compare different organisms, as well as providing the possibility to investigate them with the same framework. By using the sensitivity and robustness analysis, our framework identifies the most sensitive and fragile components of the biological systems we take into account, allowing us to compare their models. We adopt the identifiability analysis to detect functional relations among enzymes; we observe that RuBisCO, GAPDH, and FBPase belong to the same functional group, as suggested also by the sensitivity analysis.

Robust design of microbial strains.

MOTIVATION: Metabolic engineering algorithms provide means to optimize a biological process leading to the improvement of a biotechnological interesting molecule. Therefore, it is important to understand how to act in a metabolic pathway in order to have the best results in terms of productions. In this work, we present a computational framework that searches for optimal and robust microbial strains that are able to produce target molecules. Our framework performs three tasks: it evaluates the parameter sensitivity of the microbial model, searches for the optimal genetic or fluxes design and finally calculates the robustness of the microbial strains. We are capable to combine the exploration of species, reactions, pathways and knockout parameter spaces with the Pareto-optimality principle. RESULTS: Our framework provides also theoretical and practical guidelines for design automation. The statistical cross comparison of our new optimization procedures, performed with respect to currently widely used algorithms for bacteria (e.g. Escherichia coli) over different multiple functions, reveals good performances over a variety of biotechnological products. AVAILABILITY: http://www.dmi.unict.it/nicosia/pathDesign.html. CONTACT: nicosia@dmi.unict.it or pl219@cam.ac.uk SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

OREMPdb: a semantic dictionary of computational pathway models.

BACKGROUND: The information coming from biomedical ontologies and computational pathway models is expanding continuously: research communities keep this process up and their advances are generally shared by means of dedicated resources published on the web. In fact, such models are shared to provide the characterization of molecular processes, while biomedical ontologies detail a semantic context to the majority of those pathways. Recent advances in both fields pave the way for a scalable information integration based on aggregate knowledge repositories, but the lack of overall standard formats impedes this progress. Indeed, having different objectives and different abstraction levels, most of these resources "speak" different languages. Semantic web technologies are here explored as a means to address some of these problems. METHODS: Employing an extensible collection of interpreters, we developed OREMP (Ontology Reasoning Engine for Molecular Pathways), a system that abstracts the information from different resources and combines them together into a coherent ontology. Continuing this effort we present OREMPdb; once different pathways are fed into OREMP, species are linked to the external ontologies referred and to reactions in which they participate. Exploiting these links, the system builds species-sets, which encapsulate species that operate together. Composing all of the reactions together, the system computes all of the reaction paths from-and-to all of the species-sets. RESULTS: OREMP has been applied to the curated branch of BioModels (2011/04/15 release) which overall contains 326 models, 9244 reactions, and 5636 species. OREMPdb is the semantic dictionary created as a result, which is made of 7360 species-sets. For each one of these sets, OREMPdb links the original pathway and the link to the original paper where this information first appeared.

Identification of sensitive enzymes in the photosynthetic carbon metabolism.

Understanding and optimizing the CO(2) fixation process would allow human beings to address better current energy and biotechnology issues. We focused on modeling the C(3) photosynthetic Carbon metabolism pathway with the aim of identifying the minimal set of enzymes whose biotechnological alteration could allow a functional re-engineering of the pathway. To achieve this result we merged in a single powerful pipe-line Sensitivity Analysis (SA), Single- (SO) and Multi-Objective Optimization (MO), and Robustness Analysis (RA). By using our recently developed multipurpose optimization algorithms (PAO and PMO2) here we extend our work exploring a large combinatorial solution space and most importantly, here we present an important reduction of the problem search space. From the initial number of 23 enzymes we have identified 11 enzymes whose targeting in the C(3) photosynthetic Carbon metabolism would provide about 90% of the overall functional optimization. Both in terms of maximal CO(2) Uptake and minimal Nitrogen consumption, these 11 sensitive enzymes are confirmed to play a key role. Finally we present a RA to confirm our findings.

Protein multiple sequence alignment by hybrid bio-inspired algorithms.

This article presents an immune inspired algorithm to tackle the Multiple Sequence Alignment (MSA) problem. MSA is one of the most important tasks in biological sequence analysis. Although this paper focuses on protein alignments, most of the discussion and methodology may also be applied to DNA alignments. The problem of finding the multiple alignment was investigated in the study by Bonizzoni and Vedova and Wang and Jiang, and proved to be a NP-hard (non-deterministic polynomial-time hard) problem. The presented algorithm, called Immunological Multiple Sequence Alignment Algorithm (IMSA), incorporates two new strategies to create the initial population and specific ad hoc mutation operators. It is based on the 'weighted sum of pairs' as objective function, to evaluate a given candidate alignment. IMSA was tested using both classical benchmarks of BAliBASE (versions 1.0, 2.0 and 3.0), and experimental results indicate that it is comparable with state-of-the-art multiple alignment algorithms, in terms of quality of alignments, weighted Sums-of-Pairs (SP) and Column Score (CS) values. The main novelty of IMSA is its ability to generate more than a single suboptimal alignment, for every MSA instance; this behaviour is due to the stochastic nature of the algorithm and of the populations evolved during the convergence process. This feature will help the decision maker to assess and select a biologically relevant multiple sequence alignment. Finally, the designed algorithm can be used as a local search procedure to properly explore promising alignments of the search space.

Generalized pattern search algorithm for Peptide structure prediction.

Finding the near-native structure of a protein is one of the most important open problems in structural biology and biological physics. The problem becomes dramatically more difficult when a given protein has no regular secondary structure or it does not show a fold similar to structures already known. This situation occurs frequently when we need to predict the tertiary structure of small molecules, called peptides. In this research work, we propose a new ab initio algorithm, the generalized pattern search algorithm, based on the well-known class of Search-and-Poll algorithms. We performed an extensive set of simulations over a well-known set of 44 peptides to investigate the robustness and reliability of the proposed algorithm, and we compared the peptide conformation with a state-of-the-art algorithm for peptide structure prediction known as PEPstr. In particular, we tested the algorithm on the instances proposed by the originators of PEPstr, to validate the proposed algorithm; the experimental results confirm that the generalized pattern search algorithm outperforms PEPstr by 21.17% in terms of average root mean-square deviation, RMSD C(alpha).